Propagation of Truth Value Constraints in Hierarchical Multi-Valued Logic Network
نویسندگان
چکیده
منابع مشابه
Multi-Valued Logic Synthesis
We survey some of the methods used for manipulating, representing, and optimizing multi-valued logic with the view of both building a better understanding of the more specialized binary-valued logic, as well as motivating research towards a true multi-valued multi-level optimization package.
متن کاملTruth Discovery from Conflicting Multi-Valued Objects
Truth discovery is a fundamental research topic, which aims at identifying the true value(s) of objects of interest given the conflicting multi-sourced data. Although considerable research efforts have been conducted on this topic, we can still point out two significant issues unsolved: i) single-valued assumption, i.e., current methods assume only one true value for each object, while in reali...
متن کاملLinguistic Truth-value Lattice-valued Logic System with Important Coefficient and Its Application to Evaluation System
In this paper, a linguistic truth-value lattice proposition logic system LTV LP (X) is presented firstly. It is an useful and reasonable tool to deal with the linguistic term set including linear ordered set and non-linear ordered set. Then an operator linguistic truth-value lattice-valued proposition logic OLTV LP (X) is given. The OLTV LP (X) can provide a theoretical model for multi-evaluato...
متن کاملTruth and knowledge fixpoint semantics for many-valued logic programming
The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theore...
متن کاملProbabilistic and Truth-Functional Many-Valued Logic Programming
We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Systems
سال: 1997
ISSN: 0915-647X,2432-9932
DOI: 10.3156/jfuzzy.9.3_408